Competitive Helping in Online Giving
نویسندگان
چکیده
Unconditional generosity in humans is a puzzle. One possibility is that individuals benefit from being seen as generous if there is competition for access to partners and if generosity is a costly-and therefore reliable-signal of partner quality [1-3]. The "competitive helping" hypothesis predicts that people will compete to be the most generous, particularly in the presence of attractive potential partners [1]. However, this key prediction has not been directly tested. Using data from online fundraising pages, we demonstrate competitive helping in the real world. Donations to fundraising pages are public and made sequentially. Donors can therefore respond to the behavior of previous donors, creating a potential generosity tournament. Our test of the competitive helping hypothesis focuses on the response to large, visible donations. We show that male donors show significantly stronger responses (by donating more) when they are donating to an attractive female fundraiser and responding to a large donation made by another male donor. The responses for this condition are around four times greater than when males give to less-attractive female (or male) fundraisers or when they respond to a large donation made by a female donor. Unlike males, females do not compete in donations when giving to attractive male fundraisers. These data suggest that males use competitive helping displays in the presence of attractive females and suggest a role for sexual selection in explaining unconditional generosity.
منابع مشابه
Competitive helping increases with the size of biological markets and invades defection.
Cooperation between unrelated individuals remains a puzzle in evolutionary biology. Recent work indicates that partner choice can select for high levels of helping. More generally, helping can be seen as but one strategy used to compete for partners within a broader biological market, yet giving within such markets has received little mathematical investigation. In the present model, individual...
متن کاملThe Relative Worst Order Ratio for On-Line Bin Packing Algorithms∗
The relative worst order ratio, a new measure for the quality of online algorithms, was defined in [3]. Classical bin packing algorithms such as First-Fit, Best-Fit, and Next-Fit were analyzed using this measure, giving results that are consistent with those previously obtained with the competitive ratio or the competitive ratio on accommodating sequences, but also giving new separations and ea...
متن کاملImproving the Competitive Ratio of the Online OVSF Code Assignment Problem
Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper and lower bounds on the competitive ratio were 10 and 5/3, respectively. In this paper, we improve them to 7 and 2, respectively. We als...
متن کاملA o(n) -Competitive Deterministic Algorithm for Online Matching on a Line
Online matching on a line involves matching an online stream of items of various sizes to stored items of various sizes, with the objective of minimizing the average discrepancy in size between matched items. The best previously known upper and lower bounds on the optimal deterministic competitive ratio are linear in the number of items, and constant, respectively. We show that online matching ...
متن کاملOnline Budgeted Maximum Coverage
We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a given budget. Upon arrival of a set the algorithm must decide whether to accept or to reject the arriving set, and it may also drop previously acce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Current Biology
دوره 25 شماره
صفحات -
تاریخ انتشار 2015